MooFuzz: Many-Objective Optimization Seed Schedule for Fuzzer
نویسندگان
چکیده
Coverage-based Greybox Fuzzing (CGF) is a practical and effective solution for finding bugs vulnerabilities in software. A key challenge of CGF how to select conducive seeds allocate accurate energy. To address this problem, we propose novel many-objective optimization solution, MooFuzz, which can identify different states the seed pool continuously gather information about guide schedule energy allocation. First, MooFuzz conducts risk marking dangerous positions source code. Second, it automatically update collected information, including path risk, frequency, mutation information. Next, classifies into three adopts objectives seeds. Finally, design an recovery mechanism monitor usage fuzzing process reduce consumption. We implement our framework evaluate on seven real-world programs. The experimental results show that outperforms other state-of-the-art fuzzers, AFL, AFLFast, FairFuzz, PerfFuzz, terms discovery bug detection.
منابع مشابه
Using Different Many-Objective Techniques in Particle Swarm Optimization for Many Objective Problems: An Empirical Study
Pareto based Multi-Objective Evolutionary Algorithms face several problems when dealing with a large number of objectives. In this situation, almost all solutions become nondominated and there is no pressure towards the Pareto Front. The use of Particle Swarm Optimization algorithm (PSO) in multi-objective problems grew in recent years. The PSO has been found very efficient in solve Multi-Objec...
متن کاملEffective ranking + speciation = Many-objective optimization
Multiobjective optimization problems have been widely addressed using evolutionary computation techniques. However, when dealing with more than three conflicting objectives (the so-called many-objective problems), the performance of such approaches deteriorates. The problem lies in the inability of Pareto dominance to provide an effective discrimination. Alternative ranking methods have been su...
متن کاملMany objective optimization and hypervolume based search
Multiobjective optimization problems occur frequently in practice where multiple objectives have to be optimized simultaneously and the goal is to find or approximate the set of Pareto-optimal solutions. Multiobjective evolutionary algorithms (MOEAs) are one type of randomized search heuristics that are well-suited for multiobjective optimization problems due to their ability of computing a set...
متن کاملMany-Objective Optimization: An Engineering Design Perspective
Evolutionary multicriteria optimization has traditionally concentrated on problems comprising 2 or 3 objectives. While engineering design problems can often be conveniently formulated as multiobjective optimization problems, these often comprise a relatively large number of objectives. Such problems pose new challenges for algorithm design, visualisation and implementation. Each of these three ...
متن کاملA New Evolutionary Decision Theory for Many-Objective Optimization Problems
In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that all objectives have equal importance. The key contribution of this paper is the discovery of the new definition of optimality called ε-optimality for MOP that is based on a new conception, so called ε-dominance, which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9030205